Path decomposition

Results: 318



#Item
1Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
2Graph theory / NP-complete problems / Graph operations / Graph coloring / Interval graph / Hamiltonian path / Bipartite graph / Ear decomposition / Indifference graph / Chordal graph / Cograph / Strongly chordal graph

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-11-30 14:19:38
3Graph theory / Mathematics / Network theory / Edsger W. Dijkstra / Shortest path problem / Graph / Planar separator theorem / Graph coloring

A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen Department of Mathematical Sciences The Johns Hopkins University Baltimore, MD 21218 

Add to Reading List

Source URL: www.cs.tufts.edu

Language: English - Date: 2012-10-31 09:54:23
4Graph theory / Mathematics / Network theory / Wireless sensor network / Edsger W. Dijkstra / Flow network / Operations research / Sensor node / Decomposition method / Shortest path problem

Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks Ren-Shiou Liu Prasun Sinha

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2009-12-22 15:26:50
5Graph theory / Mathematics / Graph coloring / Degree / Graph / Eulerian path / Ear decomposition / NP-complete problems / Graph operations / Dominating set / Incidence coloring

Graph Editing to a Given Degree Sequence? Petr A. Golovach1,2 and George B. Mertzios3 1 Department of Informatics, University of Bergen, Norway, . 2

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-03-02 03:52:29
6Graph theory / Mathematics / NP-complete problems / Matroid theory / Steiner tree problem / Bipartite graph / Eulerian path / Graph / Degree / Ear decomposition / Directed graph / Cycle

CS261: Exercise Set #7 For the week of February 15–19, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-18 01:28:39
7Graph theory / Mathematics / Eulerian path / Tree / Cycle / Degree / Vertex / Graph / Ear decomposition / Cycle space / Pathwidth

NEW PROXIMITY-PRESERVING ORDERINGS FOR SPATIAL DATA Alan Saalfeld Bureau of the Census1 Washington, DC 20233

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-29 21:44:38
8Graph theory / Planar graphs / SPQR tree / 1-planar graph / Ear decomposition / Hamiltonian path / Tree / Outerplanar graph / Line graph

Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time Seok-Hee Hong1 and Hiroshi Nagamochi2 1 University of Sydney, Australia

Add to Reading List

Source URL: www.amp.i.kyoto-u.ac.jp

Language: English - Date: 2014-09-07 19:39:32
9Graph theory / Graph operations / Graph coloring / Chordal graph / Graph minor / Cograph / Intersection graph / RobertsonSeymour theorem / Forbidden graph characterization / Clique / Pathwidth / Line graph

Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro

Add to Reading List

Source URL: dl.dropboxusercontent.com

Language: English
10Graph theory / Mathematics / Discrete mathematics / Bayesian network / Graph isomorphism / Directed graph / Ear decomposition / Graph / Expander graph / Eulerian path

Asymptotic Learning on Bayesian Social Networks∗ Elchanan Mossel Allan Sly Omer Tamuz

Add to Reading List

Source URL: people.hss.caltech.edu

Language: English - Date: 2014-01-28 19:58:46
UPDATE